Epsilon Equitable Partition: A positional analysis method for large social networks
نویسندگان
چکیده
Positional analysis is considered an important tool in the analysis of social networks. It involves partitioning of the set of actors into subsets such that actors in a subset are similar in their structural relationships with other actors. Traditional methods of positional analysis such as structural equivalence, regular equivalence, and equitable partitions are either too strict or too generic. For real world large graphs, most of these methods result into almost trivial partitions. We propose a useful relaxation to the concept of equitable partition called an epsilon equitable partition. A variant of epsilon equitable partition called maximal epsilon equitable partition is also proposed and formulated as an optimization problem. A fast algorithm for computing epsilon equitable partitions is proposed. We also present the results of performing positional analysis on a number of networks and demonstrate empirically that positional analysis with our notion gives raise to non-trivial and meaningful partitions. Along with the static network analysis with respect to positions, we study the impact of positional analysis on the evolution of networks. Our results show that positional analysis indeed plays an important role in the evolution of networks.
منابع مشابه
Scalable Positional Analysis for Studying Evolution of Nodes in Networks
In social network analysis, the fundamental idea behind the notion of position is to discover actors who have similar structural signatures. Positional analysis of social networks involves partitioning the actors into disjoint sets using a notion of equivalence which captures the structure of relationships among actors. Classical approaches to Positional Analysis, such as Regular equivalence an...
متن کاملA Graph Partitioning Game for Distributed Simulation of Networks
Distributed simulation of large and complex networks requires equitable partitioning of the network model. We propose an iterative partitioning scheme for distributed network simulation that is based on a game theoretic model of simulated network nodes acting as players. We first model the cost function for the nodes and prove that a Nash equilibrium exists for the non-cooperative game in pure ...
متن کاملAn assessment of pedestrian networks in accessible neighborhoods: traditional neighborhoods in Iran
Accessibility is one of the important factors in public open space design and the creation of equitable neighborhoods. Limitations caused by physical disabilities should not be a barrier for accessing desired spaces and people must be able to live with the greatest possible independence regardless of mobility limitations. The purpose of this paper was to identify the inclusive criteria of pe...
متن کاملLPKP: location-based probabilistic key pre-distribution scheme for large-scale wireless sensor networks using graph coloring
Communication security of wireless sensor networks is achieved using cryptographic keys assigned to the nodes. Due to resource constraints in such networks, random key pre-distribution schemes are of high interest. Although in most of these schemes no location information is considered, there are scenarios that location information can be obtained by nodes after their deployment. In this paper,...
متن کاملPartition signed social networks via clustering dynamics
Inspired by the dynamics phenomenon occurred in social networks, the WJJLGS model is modified to imitate the clustering dynamics of signed social networks. Analyses show that the clustering dynamics of the model can be applied to partition signed social networks. Traditionally, blockmodel is applied to partition signed networks. In this paper, a detailed dynamics-based algorithm for signed soci...
متن کامل